Cascade-based attacks on complex networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cascade-based attacks on complex networks.

We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade ...

متن کامل

Complex networks vulnerability to module-based attacks

In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from practical points of view. In this contribution we present a module-based method to efficiently break complex networks. The procedure first identifies the communities in which the network can be represented, then it deletes the nodes (edges) th...

متن کامل

Vulnerability of Complex Networks in Center-Based Attacks

We study the vulnerability of synthetic as well as real-world networks in center-based attacks. These attacks are node-removal attacks which involve identifying the central node set and removing them from the network.

متن کامل

Tolerance of Local Information-Based Intentional Attacks in Complex Networks

We study the tolerance of complex networks against intentional attack which takes down network nodes in a decreasing order of their degrees. Specifically, we evaluate an effect which has been largely ignored in existing studies: in many real-life systems such as communication networks, attacks typically propagate throughout the networks from compromised nodes to their adjacent nodes, utilizing ...

متن کامل

Degree-based attacks and defense strategies in complex networks.

We study the stability of random scale-free networks to degree-dependent attacks. We present analytical and numerical results to compute the critical fraction p_{c} of nodes that need to be removed for destroying the network under this attack for different attack parameters. We study the effect of different defense strategies, based on the addition of a constant number of links on network robus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2002

ISSN: 1063-651X,1095-3787

DOI: 10.1103/physreve.66.065102